Approximating maximum edge 2-coloring in simple graphs via local improvement

AbstractWe present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of 2429≈0.828